Note on cyclic decompositions of complete bipartite graphs into cubes
نویسنده
چکیده
So far, the smallest complete bipartite graph which was known to have a cyclic decomposition into cubes Qd of a given dimension d was Kd2d−1,d2d−2 . We improve this result and show that also Kd2d−2,d2d−2 allows a cyclic decomposition into Qd. We also present a cyclic factorization of K8,8 into Q4.
منابع مشابه
Cyclic type factorizations of complete bipartite graphs into hypercubes
So far, the smallest complete bipartite graph which was known to have a cyclic type decomposition into cubes Qd of a given dimension d was Kd2d−2,d2d−2. Using binary Hamming codes we prove in this paper that there exists a cyclic type factorization of K2d−1,2d−1 into Qd if and only if d is a power of 2.
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملBalanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations
A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal t...
متن کاملDecomposition of certain complete bipartite graphs into prisms
R. Häggkvist proved that every 3-regular bipartite graph of order 2n with no component isomorphic to the Heawood graph decomposes the complete bipartite graph K6n,6n. In [1] Cichacz and Froncek established a necessary and sufficient condition for the existence of a factorization of the complete bipartite graph Kn,n into generalized prisms of order 2n. In [2] and [3] Cichacz, Froncek, and Kovar ...
متن کاملOn γ-labeling the almost-bipartite graph Pm+e
An almost-bipartite graph is a non-bipartite graph with the property that the removal of a particular single edge renders the graph bipartite. A graph labeling of an almost-bipartite graph G with n edges that yields cyclic G-decompositions of the complete graph K2nt+1 was recently introduced by Blinco, El-Zanati, and Vanden Eynden. They called such a labeling a γ-labeling. Here we show that the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 19 شماره
صفحات -
تاریخ انتشار 1999